Similarity Analysis of User Trajectories Based on Haversine Distance and Needleman Wunsch Algorithm
نویسندگان
چکیده
Abstract: In this paper, we discuss the similarity between two trajectories using Needleman Wunsch algorithm. The calculation steps are interpolating trajectory, calculating distance trajectory coordinates, identifying equivalent length, transforming into a sequence of alphabetic letters, aligning sequences, and measuring magnitude based on alignment results. obtained is compared directly to length shared by lines. results show that accuracy method reaches more than 90%. Abstrak: Dalam tulisan ini dibahas cara perhitungan persentase kesamaan dari dua buah lintasan menggunakan algoritma dan secara manual berdasarkan irisan lintasan-lintasan tersebut. Pada Wunsch, tahapan-tahapan yang dilakukan adalah menginterpolasi lintasan, menghitung jarak antara titik-titik koordinat kedua mengidentifikasi ekivalen, mengubah menjadi sekuens huruf alfabet, menyejajarkan sekuens, menentukan besarnya hasil penyejajaran. Kesamaan diperoleh metode penyejajaran dibandingkan langsung dengan panjang jalur dilalui bersama oleh menunjukkan bahwa akurasi mencapai lebih
منابع مشابه
Multiple Pairwise Sequences Alignments with Needleman-Wunsch Algorithm on GPU
Pairwise sequence alignment is the method to find the best matching piece for two sequences. It can be either local which return the most similar subsequence or global which return the alignment of whole sequence. Nowadays, the number of genetic sequences increases exponentially so that it becomes a challenge to analyze and understand those data. The cutting-edge parallel architectures provide ...
متن کاملTree Alignment Based on Needleman-Wunsch Algorithm for Sensor Selection in Smart Homes
Activity recognition in smart homes aims to infer the particular activities of the inhabitant, the aim being to monitor their activities and identify any abnormalities, especially for those living alone. In order for a smart home to support its inhabitant, the recognition system needs to learn from observations acquired through sensors. One question that often arises is which sensors are useful...
متن کاملParalellization of Needleman-Wunsch String Alignment Method
The identification of homologies between protein sequences is a central problem in molecular biology and several algorithms have been proposed for accomplishing this task. The Needleman-Wunsch Algorithm and its close variant, the SmithWaterman dynamic programming methods, solve the problem exactly in quadratic time and space. However, due to the massive amount of data involved in sequence-to-da...
متن کاملPart I : Pairwise Global Alignment with the Needleman - Wunsch
To understand the value of aligning genes and recognize the practical applications of this technique. To gain familiarity with the use of Web-based alignment tools to explore sequence similarity and understand how to modify their parameters. To know how the Needleman-Wunsch algorithm optimally aligns any two sequences. Understand how the Needleman-Wunsch algorithm can be modified to yie...
متن کاملAn Analysis of Pairwise Sequence Alignment Algorithm Complexities: Needleman-Wunsch, Smith-Waterman, FASTA, BLAST and Gapped BLAST
Introduction As databases of protein sequences and properties increase in size, it becomes more and more reliable to depend on previously classified proteins to determine the structure and function of a novel protein. One method of determining homology between two proteins is through a pair-wise sequence alignment of their primary structures. It has been found that two proteins that are homolog...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Elkawnie: journal of islamic science and technology
سال: 2022
ISSN: ['2460-8912', '2460-8920']
DOI: https://doi.org/10.22373/ekw.v7i2.9232